Path Capacity Dimensioning in a Multiprotocol Label Switched Network: Analysis of Optimal and Suboptimal Solutions

In recent years, the problem of capacity allocation for a label switched patch (LSP) in a multiprotocol label switched (MPLS) network has received great attention due to its relevance in the context of traffic control. In this paper, the problem of capacity allocation is formulated as an optimal control problem and its solution is obtained by assuming the knowledge of the bandwidth requests on the entire control interval. A suboptimal solution is also given which has the advantage of requiring limited information about future bandwidth requests. The analysis of the suboptimal solution is explored both analytically and numerically by using simulated and real data. This study demonstrates that the suboptimal solution, also with limited knowledge of the future, yields a good approximation of the optimal one and requires little additional cost.